A Factorization Theorem for Classical Group Characters, with Applications to Plane Partitions and Rhombus Tilings
نویسندگان
چکیده
1 , . . . , xn, x −1 n factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at −x1, . . . ,−xn, if M is even, while it factorizes into a product of a symplectic character and an even orthogonal character, both of rectangular shape, if M is odd. It is furthermore shown that the first factorization implies a factorization theorem for rhombus tilings of a hexagon, which has an equivalent formulation in terms of plane partitions. A similar factorization theorem is proven for the sum of two Schur functions of respective rectangular shapes (Mn) and (M).
منابع مشابه
Rhombus Tilings of a Hexagon with Three Missing Border Triangles
The interest in rhombus tilings has emerged from the enumeration of plane partitions in a given box (which was first carried out by MacMahon [5]). The connection comes from looking at the stacks of cubes of a plane partition from the right direction and projecting the picture to the plane. Then the box becomes a hexagon, where opposite sides are equal, and the cubes become a rhombus tiling of t...
متن کاملEnumeration of Rhombus Tilings of a Hexagon which Contain a Fixed Rhombus in the Centre
Let a, b and c be positive integers and consider a hexagon with side lengths a,b,c,a,b,c whose angles are 120◦ (see Figure 1). The subject of our interest is rhombus tilings of such a hexagon using rhombi with all sides of length 1 and angles 60◦ and 120◦. Figure 2 shows an example of a rhombus tiling of a hexagon with a = 3, b = 5 and c = 4. A first natural question to be asked is how many rho...
متن کاملA Schur function identity related to the (-1)-enumeration of self-complementary plane partitions
We give another proof for the (−1)–enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley’s proof for the ordinary enumeration. In addition, we obtain enumerations of 180◦-symmetric rhombus tilings of hexagons with a barrier of arbitrary length along the central line.
متن کاملA Curious Family of Binomial Determinants That Count Rhombus Tilings of a Holey Hexagon
We evaluate a curious determinant, first mentioned by George Andrews in 1980 in the context of descending plane partitions. Our strategy is to combine the famous Desnanot-Jacobi-Carroll identity with automated proof techniques. More precisely, we follow the holonomic ansatz that was proposed by Doron Zeilberger in 2007. We derive a compact and nice formula for Andrews’s determinant, and use it ...
متن کاملQuadri-tilings of the plane
We introduce quadri-tilings and show that they are in bijection with dimer models on a family of graphs R * arising from rhombus tilings. Using two height functions, we interpret a sub-family of all quadri-tilings, called triangular quadri-tilings, as an interface model in dimension 2+2. Assigning “critical” weights to edges of R *, we prove an explicit expression, only depending on the local g...
متن کامل